Packing density

 ( Packing Problems ) 

A packing density or packing fraction of a packing in some space is the fraction of the space filled by the figures making up the packing. In simplest terms, this is the ratio of the volume of bodies in a space to the volume of the space itself. In packing problems, the objective is usually to obtain a packing of the greatest possible density.

---

In compact spaces If $K\_1,\backslash dots,\; K\_n$ are measurable subsets of a Compact space measure space $X$ and their interiors pairwise do not intersect, then the collection $K\_i$ is a packing in $X$ and its packing density is $$\backslash eta=\backslash frac\{\backslash sum\_\{i=1\}^\{n\}\backslash mu(K\_i)\}\{\backslash mu(X)\}.$$

---

In Euclidean space If the space being packed is infinite in measure, such as Euclidean space, it is customary to define the density as the limit of densities exhibited in balls of larger and larger radii. If $B\_t$ is the ball of radius $t$ centered at the origin, then the density of a packing $K\_i:i\backslash in\backslash N$ is $$\backslash eta\; =\; \backslash lim\_\{t\backslash to\backslash infty\}\backslash frac\{\backslash sum\_\{i=1\}^\{\backslash infty\}\backslash mu(K\_i\backslash cap\; B\_t)\}\{\backslash mu(B\_t)\}.$$ Since this limit does not always exist, it is also useful to define the upper and lower densities as the limit superior and limit inferior of the above respectively. If the density exists, the upper and lower densities are equal. Provided that any ball of the Euclidean space intersects only finitely many elements of the packing and that the diameters of the elements are bounded from above, the (upper, lower) density does not depend on the choice of origin, and $\backslash mu(K\_i\backslash cap\; B\_t)$ can be replaced by $\backslash mu(K\_i)$ for every element that intersects $B\_t$. The ball may also be replaced by dilations of some other convex body, but in general the resulting densities are not equal.

---

Optimal packing density One is often interested in packings restricted to use elements of a certain supply collection. For example, the supply collection may be the set of all balls of a given radius. The optimal packing density or packing constant associated with a supply collection is the supremum of upper densities obtained by packings that are subcollections of the supply collection. If the supply collection consists of convex bodies of bounded diameter, there exists a packing whose packing density is equal to the packing constant, and this packing constant does not vary if the balls in the definition of density are replaced by dilations of some other convex body.

A particular supply collection of interest is all of a fixed convex body $K$. In this case, we call the packing constant the packing constant of $K$. The Kepler conjecture is concerned with the packing constant of 3-balls. Ulam's packing conjecture states that 3-balls have the lowest packing constant of any convex solid. All translations of a fixed body is also a common supply collection of interest, and it defines the translative packing constant of that body.

---

See also

• Atomic packing factor
• Sphere packing
• List of shapes with known packing constant

---

External links

Categories: Packing Problems, Discrete Geometry

Post Comment